Daniel Marx

Results: 86



#Item
61

Fixed Parameter Algorithms Dániel Marx Tel Aviv University, Israel International Workshop on Tractability July 5, 2010, Microsoft Research, Cambridge, UK

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2010-07-08 10:34:10
    62

    Fine-Grained Complexity and Algorithm Design Boot Camp Parameterized Reductions Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2015-09-02 17:28:08
      63

      Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control,

      Add to Reading List

      Source URL: www.cs.bme.hu

      Language: English - Date: 2015-09-01 20:36:26
        64

        A Fixed-parameter algorithms for minimum cost edge-connectivity augmentation ´ DANIEL MARX, Institute for Computer Science and Control, Hungarian Academy of Sciences

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2014-10-10 07:53:16
          65

          THE COMPLEXITY OF GLOBAL CARDINALITY CONSTRAINTS ´ ANDREI A. BULATOV AND DANIEL MARX School of Computing Science, Simon Fraser University, Burnaby, Canada e-mail address:

          Add to Reading List

          Source URL: www.cs.bme.hu

          Language: English - Date: 2010-09-10 06:41:38
            66

            FPT algorithmic techniques Dániel Marx Budapest University of Technology and Economics, Hungary AGAPE’09 Spring School on Fixed Parameter and Exact Algorithms May 25-26, 2009, Lozari, Corsica (France)

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2009-05-29 05:51:16
              67

              Parameterized coloring problems on chordal graphs ´ Daniel Marx Budapest University of Technology and Economics

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2007-10-29 10:13:53
                68

                Closest substring problems with small distances ´ Daniel Marx ¨ zu Berlin

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2007-10-29 10:15:50
                  69

                  doi: Constraint Satisfaction Problems and Global Cardinality Constraints By Andrei A. Bulatov and Dániel Marx

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2010-09-01 04:27:36
                    70

                    Minicourse on parameterized algorithms and complexity Part 3: Randomized techniques Dániel Marx Jagiellonian University in Kraków

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2015-04-20 11:48:46
                      UPDATE